First-Order Proofs for Higher-Order Languages
نویسنده
چکیده
We study the use of the-calculus for semantical descriptions of higher-order concurrent languages with state. As an example, we choose Concurrent Idealized ALGOL (CIA). CIA is particularly interesting as, yet being a core language, it combines imperative and parallel features with a procedural mechanism of full higher order. It can thus be used as a formal model for concurrent programs as, e.g., remote procedure calls or remote execution of program parts. However, deriving congruence laws for languages of this kind is hard, as they combine higher order with local state. In order to conduct proofs of laws and examples in a rst-order environment, we encode CIA in the-calculus, exploiting results that its mobility allows a rst-order description of higher order. Moreover, by translating CIA into , we can make use of the various proof techniques that have been developed for the calculus.
منابع مشابه
Matti Eklund ON HOW LOGIC BECAME FIRST-ORDER
The logical systems within which Frege, Schröder, Russell, Zermelo and other early mathematical logicians worked were all higher-order. It was not until the 1910s that first-order logic was even distinguished as a subsystem of higher-order logic. As late as in the 1920s, higherorder quantification was still quite generally allowed: in fact, it does not seem as if any major logician, among non-i...
متن کاملFirst-order reasoning for higher-order concurrency
We present a practical first-order theory of a higher-order ⇡-calculus which is both sound and complete with respect to a standard semantic equivalence. The theory is a product of combining and simplifying two of the most prominent theories for HO⇡ of Sangiorgi et al. and Je↵rey and Rathke [10, 21], and a novel approach to scope extrusion. In this way we obtain an elementary labelled transition...
متن کاملOn First Order Logic of Proofs
The Logic of Proofs LP solved long standing Gödel’s problem concerning his provability calculus (cf. [4]). It also opened new lines of research in proof theory, modal logic, typed programming languages, knowledge representation, etc. The propositional logic of proofs is decidable and admits a complete axiomatization. In this paper we show that the first order logic of proofs is not recursively ...
متن کاملSpecifying Theorem Provers in a Higher-Order Logic Programming Language
Since logic programming systems directly implement search and unification and since these operations are essential for the implementation of most theorem provers, logic programming languages should make ideal implementation languages for theorem provers. We shall argue that this is indeed the case if the logic programming language is extended in several ways. We present an extended logic progra...
متن کاملNotes on Logic
1. Syntax 1 2. Semantics 4 3. Boolean algebra 7 4. Classification 12 5. Quantum logic 15 6. Formal proofs 17 7. First-order languages and syntax 22 8. First-order semantics 25 9. Examples of first-order languages 28 10. Completeness and compactness 29 11. Consequences of compactness 31 12. Downwards Löwenheim-Skolem 34 13. Filters and ultrafilters 37 14. Voting 41 15. Ultraproducts 45 16. Forma...
متن کامل